#include <iostream>
using namespace std;
#include<bits/stdc++.h>
int main()
{
int n , k ;
cin >> n ;
cin >> k;
double arr[n][2];
for(int i = 0 ; i < n ; i ++){
for(int j = 0 ;j < 2; j++){
cin >> arr[i][j];
}
}
double arr2[n];
for(int i =0 ;i < n ; i++){
arr2[i]=sqrt((arr[i][0]-arr[i+1][0])*(arr[i][0]-arr[i+1][0])+(arr[i][1]-arr[i+1][1])*(arr[i][1]-arr[i+1][1]))/50;
}
long double sum =0;
for(int i =0 ;i < n-1 ; i++){
sum= sum +arr2[i];
}
std::cout << std::setprecision(10) << sum*k << std::endl;
}
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |